Golovin 21 . 1 Primal - Dual Algorithms
نویسنده
چکیده
So far, we have seen many algorithms based on linear program (LP) relaxations, typically involving rounding a given fractional LP solution to an integral solution of approximately the same objective value. In this lecture, we will look at another approach to LP relaxations, in which we will construct a feasible integral solution to the LP from scratch, using a related LP to guide our decisions. Our LP will be called the Primal LP, and the guiding LP will be called the Dual LP.
منابع مشابه
Daniel Golovin 21 . 1 Primal - Dual Algorithms
So far, we have seen many algorithms based on linear program (LP) relaxations, typically involving rounding a given fractional LP solution to an integral solution of approximately the same objective value. In this lecture, we will look at another approach to LP relaxations, in which we will construct a feasible integral solution to the LP from scratch, using a related LP to guide our decisions....
متن کاملPrimal-dual path-following algorithms for circular programming
Circular programming problems are a new class of convex optimization problems that include second-order cone programming problems as a special case. Alizadeh and Goldfarb [Math. Program. Ser. A 95 (2003) 3-51] introduced primal-dual path-following algorithms for solving second-order cone programming problems. In this paper, we generalize their work by using the machinery of Euclidean Jordan alg...
متن کاملUsing Combinatorial and LP-based Methods to Design Approximation Algorithms
Our goal in this proposal is to explore the connection between the local ratio technique and linear programming. We believe that a better understanding of this connection will strengthen and extend the local ratio technique and will enable us to apply the technique to a wide variety of problems. Specifically, we intend to improve the best performance guarantee and/or running time of approximati...
متن کاملSymmetric Primal-dual Path following Algorithms for Semideenite Programming
In this paper a symmetric primal-dual transformation for positive semideenite programming is proposed. For standard SDP problems, after this symmetric transformation the primal variables and the dual slacks become identical. In the context of linear programming, existence of such a primal-dual transformation is a well known fact. Based on this symmetric primal-dual transformation we derive Newt...
متن کاملA POLYNOMIAL-TIME PRIMAL-DUAL AFFINE SCALING ALGORITHM FOR LINEAR AND CONVEX QUADRATIC PROGRAMMING AND ITS POWER SERIES EXTENSION*t
We describe an algorithm for linear and convex quadratic programming problems that uses power series approximation of the weighted barrier path that passes through the current iterate in order to find the next iterate. If r > 1 is the order of approximation used, we show that our algorithm has time complexity O(n t(+l/r)L(l+l/r)) iterations and O(n3 + n2r) arithmetic operations per iteration, w...
متن کامل